1096A - Find Divisible - CodeForces Solution


greedy implementation math *800

Please click on ads to support us..

Python Code:

T = int(input())
for i in range(T):
	l, r = map(int, input().split())
	print(l, l * 2)

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int d, w,r;
    cin>>d;
    while(d--){
        cin>>w>>r;

        cout<<w<<" "<<w*2<<endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents